Reconciling exhaustive pattern matching with objects
نویسندگان
چکیده
منابع مشابه
Reconciling Exhaustive Pattern Matching with Objects: Technical Report
Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting; however, because of data abstraction, it is challenging for a compiler to statically verify p...
متن کاملFast Exhaustive Robust Matching
This work presents a fast exhaustive robust matching technique for aligning translated images. The key idea is to express a robust matching surface function in terms of correlation operations. Speed is obtained from computing correlations in the frequency domain. Different sized images and arbitrary shapes may be matched. The method outputs a matching surface representing the quality of match a...
متن کاملReconciling Schema Matching Networks
Schema matching is the process of establishing correspondences between the attributes of schemas, for the purpose of data integration. Schema matching is often performed in a pair-wise setting, in which two given schemas are matched again each other by automatic tools. In this thesis, we instead approach the schema matching problem in a network setting, in which the two schemas to be matched do...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملUnderstanding Exhaustive Pattern Learning
Pattern learning in an important problem in Natural Language Processing (NLP). Some exhaustive pattern learning (EPL) methods Bod (1992) were proved to be flawed Johnson (2002), while similar algorithms Och and Ney (2004) showed great advantages on other tasks, such as machine translation. In this article, we first formalize EPL, and then show that the probability given by an EPL model is const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2499370.2462194